Step of Proof: mul_preserves_le
12,41
postcript
pdf
Inference at
*
1
2
1
I
of proof for Lemma
mul
preserves
le
:
.....assertion..... NILNIL
1.
a
:
2.
b
:
3.
a
b
4.
n
:
5. 0 <
n
6. ((
n
- 1) *
a
)
((
n
- 1) *
b
)
(((
n
- 1) *
a
)+
a
)
(((
n
- 1) *
b
)+
b
)
latex
by ((BackThruLemma `add_functionality_wrt_le`)
CollapseTHEN ((Auto_aux (first_nat 1:n
C
) ((first_nat 1:n),(first_nat 3:n)) (first_tok :t) inil_term)))
latex
C
.
Definitions
t
T
,
P
Q
,
x
:
A
.
B
(
x
)
Lemmas
add
functionality
wrt
le
origin